Categories of Timed Stochastic Relations

نویسندگان

  • Daniel Brown
  • Riccardo Pucella
چکیده

Stochastic behavior—the probabilistic evolution of a system in time—is essential to modeling the complexity of real-world systems. It enables realistic performance modeling, quality-of-service guarantees, and especially simulations for biological systems. Languages like the stochastic pi calculus have emerged as effective tools to describe and reason about systems exhibiting stochastic behavior. These languages essentially denote continuous-time stochastic processes, obtained through an operational semantics in a probabilistic transition system. In this paper we seek a more descriptive foundation for the semantics of stochastic behavior using categories and monads. We model a first-order imperative language with stochastic delay by identifying probabilistic choice and delay as separate effects, modeling each with a monad, and combining the monads to build a model for the stochastic language.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discovering Temporal Knowledge from a Crisscross of Timed Observations

This paper is concerned with the discovering of temporal knowledge from a sequence of timed observations provided by a system monitoring of dynamic process. The discovering process is based on the Stochastic Approach framework where a series of timed observations is represented with a Markov chain. From this representation, a set of timed sequential binary relations between discrete event class...

متن کامل

Algebraic Approach to Timed Petri Nets with Applications to Communication Networks

In this diploma thesis, we define a formalism for a time-extension to classic P/T (or Petri-)nets. This allows time durations to be assigned to transitions of a P/T net, representing delays present in the systems that are being modelled, which in turn influence (restrict) the firing behaviour of the nets. This is especially useful when modelling time-critical systems. The new contribution of th...

متن کامل

On Decidability of Prebisimulation for Timed Automata

In this paper, we propose an at least as fast as relation between two timed automata states and investigate its decidability. The proposed relation is a prebisimulation and we show that given two processes with rational clock valuations it is decidable to check whether such a prebisimulation relation exists between them. Though bisimulation relations have been widely studied with respect to tim...

متن کامل

A Hybrid Language Model based on Stochastic Context-free Grammars

This paper explores the use of initial Stochastic Context-Free Grammars (SCFG) obtained from a treebank corpus for the learning of SCFG by means of estimation algorithms. A hybrid language model is defined as a combination of a word-based n-gram, which is used to capture the local relations between words, and a category-based SCFG with a word distribution into categories, which is defined to re...

متن کامل

Relations of Timed Event Graphs and Timed Automata in Fault Diagnosis

This paper investigates the relations between timed event graphs and timed automata that describe discrete–event systems subject to faults. An algorithm is presented for transforming a timed event graph into an equivalent timed automaton. The relations among the models of the faulty systems provides the basis for comparing diagnostic methods that have been developed in the past for these two ti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 249  شماره 

صفحات  -

تاریخ انتشار 2009